Extended formulations in combinatorial optimization
نویسندگان
چکیده
منابع مشابه
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By “perfect formulation”, we mean a system of linear inequalities that describes the convex hull of feasible solutions, viewed as vectors. Natural perfect formulations often have a number of inequalities that is exponential in the size of the data needed to describe the problem. Here we are p...
متن کاملExtended Formulations in Combinatorial Optimization
The concept of representing a polytope that is associated with some combinatorial optimization problem as a linear projection of a higherdimensional polyhedron has recently received increasing attention. In this paper (written for the newsletter Optima of the Mathematical Optimization Society), we provide a brief introduction to this topic and sketch some of the recent developments with respect...
متن کاملImproving Combinatorial Optimization - Extended Abstract
Combinatorial Optimization is an important area of computer science that has many theoretical and practical applications. In the thesis [Chu, 2011], we present important contributions to several different areas of combinatorial optimization, including nogood learning, symmetry breaking, dominance, relaxations and parallelization. We develop a new nogood learning technique based on constraint pr...
متن کاملDistributed Combinatorial Optimization – Extended Abstract
Approximating integer linear programs by solving a relaxation to a linear program (LP) and afterwards reconstructing an integer solution from the fractional one is a standard technique in a non-distributed scenario. Surprisingly, the method has not often been applied for distributed algorithms. In this paper, we show that LP relaxation is a powerful technique also to obtain fast distributed app...
متن کاملExtended Formulations for Online Linear Bandit Optimization
On-line linear optimization on combinatorial action sets (d-dimensional actions) with bandit feedback, is known to have complexity in the order of the dimension of the problem. The exponential weighted strategy achieves the best known regret bound that is of the order of d √ n (where d is the dimension of the problem, n is the time horizon ). However, such strategies are provably suboptimal or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2010
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-010-0122-z